Trees with a large Laplacian eigenvalue multiplicity
نویسندگان
چکیده
منابع مشابه
Partial characterization of graphs having a single large Laplacian eigenvalue
The parameter σ(G) of a graph G stands for the number of Laplacian eigenvalues greater than or equal to the average degree of G. In this work, we address the problem of characterizing those graphs G having σ(G) = 1. Our conjecture is that these graphs are stars plus a (possible empty) set of isolated vertices. We establish a link between σ(G) and the number of anticomponents of G. As a by-produ...
متن کاملMULTIPLICITY RESULTS FOR p-SUBLINEAR p-LAPLACIAN PROBLEMS INVOLVING INDEFINITE EIGENVALUE PROBLEMS VIA MORSE THEORY
We establish some multiplicity results for a class of p-sublinear pLaplacian problems involving indefinite eigenvalue problems using Morse theory.
متن کاملBipartite graphs with small third Laplacian eigenvalue
In this paper, all connected bipartite graphs are characterized whose third largest Laplacian eigenvalue is less than three. Moreover, the result is used to characterize all connected bipartite graphs with exactly two Laplacian eigenvalues not less than three, and all connected line graphs of bipartite graphs with the third eigenvalue of their adjacency matrices less than one. c © 2003 Elsevier...
متن کاملEIGENVALUE PROBLEMS WITH p-LAPLACIAN OPERATORS
In this article, we study eigenvalue problems with the p-Laplacian operator: −(|y′|p−2y′)′ = (p− 1)(λρ(x)− q(x))|y|p−2y on (0, πp), where p > 1 and πp ≡ 2π/(p sin(π/p)). We show that if ρ ≡ 1 and q is singlewell with transition point a = πp/2, then the second Neumann eigenvalue is greater than or equal to the first Dirichlet eigenvalue; the equality holds if and only if q is constant. The same ...
متن کاملGraphs with small second largest Laplacian eigenvalue
Let L(G) be the Laplacian matrix of G. In this paper, we characterize all of the connected graphs with second largest Laplacian eigenvalue no more than l; where l . = 3.2470 is the largest root of the equation μ3 − 5μ2 + 6μ − 1 = 0. Moreover, this result is used to characterize all connected graphs with second largest Laplacian eigenvalue no more than three. © 2013 Elsevier Ltd. All rights rese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2020
ISSN: 0024-3795
DOI: 10.1016/j.laa.2019.10.011